A Sufficient Condition to Dissolve the Combinatorial Property for LQ Problem with Actuator Selections

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A sufficient condition for pseudointegrable systems with weak mixing property

We present a sufficient condition that a pseudointegrable system has weak mixing property. The result is derived from Veech’s weak mixing theorem for interval exhange [Veech, W.A. Amer.J.Math. 106, 1331 (1984)]. We also present an example whose weak mixing property can be proved by the result.

متن کامل

A combinatorial necessary and sufficient condition for cluster consensus

In this technical note, cluster consensus of discretetime linear multi-agent systems is investigated. A set of stochastic matrices P is said to be a cluster consensus set if the system achieves cluster consensus for any initial state and any sequence of matrices taken from P . By introducing a cluster ergodicity coefficient, we present an equivalence relation between a range of characterization...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

متن کامل

A Sharp Sufficient Condition for Sparsity Pattern Recovery

Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers

سال: 1992

ISSN: 0453-4654

DOI: 10.9746/sicetr1965.28.768